Stochastic Optimization for Adapting Behaviors of Exploration Agents
نویسندگان
چکیده
Proposed missions to explore comets and moons will encounter environments that are hostile and unpredictable. A successful explorer must be able to adapt to a wide range of possible operating solutions to survive. Constructing special-purpose behaviors requires information about the environment, which is not available a priori for these missions. Instead, we propose an explorer that uses a flexible problemsolver with a significant capacity to adapt its behavior. More specifically, the explorer uses stochastic optimization techniques to continually adapt its behavior while limiting the cost of behavior exploration. With Adaptive Problem Solving, we use search techniques to enable a spacecraft to continually adapt its environment-specific behavior in-situ.
منابع مشابه
On Convergence and Parameter Selection of an Improved Particle Swarm Optimization
This paper proposes an improved particle swarm optimization named PSO with Controllable Random Exploration Velocity (PSO-CREV) behaving an additional exploration behavior. Different from other improvements on PSO, the updating principle of PSO-CREV is constructed in terms of stochastic approximation diagram. Hence a stochastic velocity independent on cognitive and social components of PSO can b...
متن کاملLearning to Cooperate
Game theory is not only useful to understand the performance of human and autonomous game players, but it is also widely employed to solve resource allocation problems in distributed decision making systems. These distributed systems are mostly referred to as multi-agent systems. Reinforcement learning is a promising technique for learning agents to adapt their own strategies in such systems. M...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملAn Inexact-Fuzzy-Stochastic Optimization Model for a Closed Loop Supply Chain Network Design Problem
The development of optimization and mathematical models for closed loop supply chain (CLSC) design has attracted considerable interest over the past decades. However, the uncertainties that are inherent in the network design and the complex interactions among various uncertain parameters are challenging the capabilities of the developed tools. The aim of this paper, therefore, is to propose a n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001